Cartesian product
英 [kɑːˈtiːziən ˈprɒdʌkt]
美 [kɑːrˈtiːziən ˈprɑːdʌkt]
网络 笛卡兒積; 笛卡尔积; 笛卡儿积; 笛卡儿乘积; 笛卡尔乘积
双语例句
- Adjacent vertex-distinguishing VE-total coloring of Cartesian product graph of some graphs
部分图笛卡儿积图的邻点可区别VE-全染色 - On the Super 3-restricted Edge Connectivity of Cartesian Product of Graphs
笛卡尔乘积图的超级3-限制边连通性 - In this paper, A theorem for the binding number of multiple cartesian product of path and circuits is proven, and some limit properties of the binding number of multiple product graphs are presented.
本文证明了路与回路的多重笛卡尔乘积的联结数的一个定理，并给出了若干多重乘积图的联结数的极限性质。 - Data may seem to disappear at this point since the joins through the fact table is likely more sparse in its combinations than the Cartesian Product results.
此刻数据好像消失了，因为事实表的连接似乎比笛卡尔Product结果更加稀少。 - It is proved that: ( 1) The cartesian product, the lexicographic product and the strong direct product in the products of connected graphs, are the path-positive graphs.
证明了：（1）如果G1和G2都是连通图，则积图中笛卡尔积，逻辑积和强直积都是道路正图。 - On Hamiltonian property and connectivity of the Cartesian product of infinite graphs
无限图的笛卡尔积的哈密顿性和连通性 - One convex set which is Cartesian product of nonregular convex polygons is used instead of the other convex set which is Cartesian product of regular polygons.
采用不规则凸多边形的笛卡儿积构成的凸集代替正多边形的笛卡儿积构成的凸集，前者比后者更紧凑。 - The1= 1 one logic is in the expression to ensure the join will always be true and allows for the Cartesian Product result set.
表达式中的1=1逻辑确保连接一直为true并允许笛卡尔Product结果集。 - If the number of tuples, calculated by using the Cartesian product, exceeds the set threshold; the NON EMPTY clause is applied to the query.
如果通过使用Cartesian产品计算的元组数超过设定的阈值，将NONEMPTY子句应用于查询。 - The Vertex Linear Arboricity of Complete Multiple Graphs and Cartesian Product Graphs
完全多部图和笛卡儿积图的线性点荫度